package day19;

import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class demo1 {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        char[]str = in.next().toCharArray();
        Map<String,Integer>map=new HashMap<>();
        for(int i=0;i<str.length;i++){
            map.put(""+str[i],map.getOrDefault(""+str[i],0)+1);
        }
        int maxn=0;
        int minx=Integer.MAX_VALUE;
        for(Map.Entry<String,Integer>entry:map.entrySet()){
            maxn=Math.max(maxn,entry.getValue());
            minx=Math.min(minx,entry.getValue());
        }
        int t=maxn-minx;
        boolean ret=panduan(t);
        if(ret){
            System.out.println("Lucky Word");
            System.out.println(t);
        }else{
            System.out.println("No Answer");
            System.out.println(0);
        }
    }

    static boolean panduan(int a) {
        for (int i = 2; i <= Math.sqrt(a); i++) {
            if (a % i == 0) {
                return true;
            }
        }
        return false;
    }

}
